Understanding the Eigenstructure of Various Triangles
نویسندگان
چکیده
We examine the eigenstructure of generalized isosceles triangles and explore the possibilities of analytic solutions to the general eigenvalue problem in other triangles. Starting with work based off of Brian McCartin’s paper on equilateral triangles, we first explore the existence of analytic solutions within the space of all isosceles triangles. We find that this method only leads to consistent solutions in the equilateral case. Next, we develop criteria for the existence of complete solutions in other triangles. We find that complete solutions are guaranteed in the equilateral, right isosceles and 30-60-90 triangles. We then use a method developed by Milan Prager to formulate solutions in the right isosceles triangle through folding transformations of solutions in the square.
منابع مشابه
Similar Triangles, Another Trace of the Golden Ratio
In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کامل$L^p$ boundedness of the Bergman projection on some generalized Hartogs triangles
In this paper we investigate a two classes of domains in $mathbb{C}^n$ generalizing the Hartogs triangle. We prove optimal estimates for the mapping properties of the Bergman projection on these domains.
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کامل